翻訳と辞書 |
Rational monoid : ウィキペディア英語版 | Rational monoid In mathematics, a rational monoid is a monoid, an algebraic structure, for which each element can be represented in a "normal form" which can be computed by a finite transducer: multiplication in such a monoid is "easy", in the sense that it can be described by a rational function. ==Definition== Consider a monoid ''M''. Consider a pair (''A'',''L'') where ''A'' is a finite subset of ''M'' that generates ''M'' as a monoid, and ''L'' is a language on ''A'' (that is, a subset of the set of all strings ''A''∗). Let φ be the map from the free monoid ''A''∗ to ''M'' given by evaluating a string as a product in ''M''. We say that ''L'' is a ''rational cross-section'' if φ induces a bijection between ''L'' and ''M''. We say that (''A'',''L'') is a ''rational structure'' for ''M'' if in addition the kernel of φ, viewed as a subset of the product monoid ''A''∗×''A''∗ is a rational set. A quasi-rational monoid is one for which ''L'' is a rational relation: a rational monoid is one for which there is also a rational function cross-section of ''L''. Since ''L'' is a subset of a free monoid, Kleene's theorem holds and a rational function is just one that can be instantiated by a finite state transducer.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Rational monoid」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|